from typing import List


class Solution:
    def minArray(self, numbers: List[int]) -> int:
        l, h = 0, len(numbers) - 1
        while l < h:
            mid = (l + h) // 2
            if numbers[mid] < numbers[h]:
                h = mid
            elif numbers[mid]>numbers[h]:
                l = mid + 1
            else:
                h-=1
        return numbers[l]


if __name__ == '__main__':
    s = Solution()
    nums = [1,3,3]
    ans = s.minArray(nums)
    print(ans)
